Solving Facility Rearrangement Problem Using a Genetic Algorithm and a Heuristic Local Search
نویسندگان
چکیده
منابع مشابه
A Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملA Non-greedy Local Search Heuristic for Facility Layout Problem
This paper proposes a non-greedy local search heuristic for solving facility layout problem. The proposed heuristic works on non-greedy systematic pair wise exchange of two facilities, that is 2-exchange local search based on non-greedy strategy. Pair wise exchanges are accepted if the objective function value after the exchange is lowered or smaller than the average objective function incremen...
متن کاملA Hybrid Genetic Algorithm for Solving Facility Location- Allocation Problem
Today’s logistic systems in companies depend on optimum solutions of Facility Location-Allocation (FLA) problems in order to minimize cost values the company is dealing with. Therefore, FLA plays an important role in nowadays business environment. In this paper, a Hybrid Genetic Algorithm (HGA) is proposed to solve FLA. The HGA is a combination of Genetic Algorithm and Tabu Search while NSGA II...
متن کاملSolving the Job Shop Scheduling Problem with a Parallel and Agent-based Local Search Genetic Algorithm
Job shop scheduling problems play an important role in both manufacturing systems and industrial process for improving the utilization of resources, and therefore it is crucial to develop efficient scheduling technologies. The Job shop scheduling problem, one of the best known production scheduling problems, has been proved to be NP-hard. In this paper, we present a parallel and agent-based loc...
متن کاملSolving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial Engineering and Management Systems
سال: 2012
ISSN: 1598-7248
DOI: 10.7232/iems.2012.11.2.170